A Chaos game algorithm for generalized iterated function systems

نویسندگان

  • Davide La Torre
  • Franklin Mendivil
چکیده

In this paper we provide an extension of the classical Chaos game for IFSP. The paper is divided into two parts: in the first one, we discuss how to determine the integral with respect to a measure which is a combination of a self-similar measure from an IFSP along with a density given by an IFSM. In the second part, we prove a version of the Ergodic Theorem for the integration of a continuous multifunction with respect to the invariant measure of an IFSP. These results are in line with some recent extensions of IFS theory to multifunctions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The chaos game on a general iterated function system

The main theorem of this paper establishes conditions under which the ‘chaos game’ algorithm almost surely yields the attractor of an iterated function system. The theorem holds in a very general setting, even for non-contractive iterated function systems, and under weaker conditions on the random orbit of the chaos game than obtained previously.

متن کامل

Chaos Games " for Iterated Function Systems withGrey Level

Two random iteration algorithms or \chaos games" for Iterated Function Systems on function spaces, namely IFS with grey level maps (IFSM), are described. The rst algorithm can be interpreted as a \chaos game in code space" and is guaranteed to work only in the case of nonoverlapping IFS maps. In the second algorithm, applicable to IFSM with overlapping IFS maps but aane grey level maps, the (no...

متن کامل

Chaotic property for non-autonomous iterated function system

In this paper, the new concept of non-autonomous iterated function system is introduced and also shown that non-autonomous iterated function system IFS(f_(1,∞)^0,f_(1,∞)^1) is topologically transitive for the metric space of X whenever the system has average shadowing property and its minimal points on X are dense. Moreover, such a system is topologically transitive, whenever, there is a point ...

متن کامل

Discrete Iterated Function Systems

discrete iterated function systems discrete iterated function systems representation of discrete sequences with dimensional discrete iterated function systems discrete iterated function systems stochastic discrete scale invariance: renormalization representation of discrete sequences with high-dimensional power domains and iterated function systems fractal tilings from iterated function systems...

متن کامل

Escape-Time Modified Algorithm for Generating Fractal Images Based on Petri Net Reachability

This paper presents a new approach to computer image generation via three proposed methods for translating the evolution of a Petri net into fractal image synthesis. The idea is derived from the concept of fractal iteration principles in the escape-time algorithm and chaos game. The approach uses a Petri net as a powerful abstract modeling tool for fractal image synthesis via its duality, deadl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 224  شماره 

صفحات  -

تاریخ انتشار 2013